Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(h(x)) |
→ f(i(x)) |
| 2: |
|
g(i(x)) |
→ g(h(x)) |
| 3: |
|
h(a) |
→ b |
| 4: |
|
i(a) |
→ b |
|
There are 4 dependency pairs:
|
| 5: |
|
F(h(x)) |
→ F(i(x)) |
| 6: |
|
F(h(x)) |
→ I(x) |
| 7: |
|
G(i(x)) |
→ G(h(x)) |
| 8: |
|
G(i(x)) |
→ H(x) |
|
The approximated dependency graph contains no SCCs
and hence the TRS is trivially terminating.
Tyrolean Termination Tool (0.00 seconds)
--- May 4, 2006